Disjoint induced subgraphs of the same order and size
نویسندگان
چکیده
منابع مشابه
Disjoint induced subgraphs of the same order and size
For a graph G, let f(G) be the largest integer k such that there are two vertex-disjoint subgraphs of G each on k vertices, both inducing the same number of edges. We prove that f(G) ≥ n/2 − o(n) for every graph G on n vertices. This answers a question of Caro and Yuster.
متن کاملLarge disjoint subgraphs with the same order and size
For a graph G let f(G) be the largest integer k so that there are two vertex-disjoint subgraphs of G, each with k vertices, and that induce the same number of edges. Clearly f(G) ≤ bn/2c but this is not always achievable. Our main result is that for any fixed α > 0, if G has n vertices and at most n2−α edges then f(G) = n/2 − o(n), which is asymptotically optimal. The proof also yields a polyno...
متن کاملInduced subgraphs with distinct size or order
We show that for every 0 < < 1/2, there is an n0 = n0( ) such that if n > n0 then every n-vertex graph G of size at least ( n 2 ) and at most (1 − ) ( n 2 ) contains induced k-vertex subgraphs with at least 10−7k different sizes, for every k ≤ n 3 This is best possible, up to a constant factor. This is also a step towards a conjecture by Erdős, Faudree and Sós on the number of distinct pairs (|...
متن کاملInduced subgraphs of prescribed size
A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) denote the maximum number of vertices in a trivial subgraph of G. Motivated by an open problem of Erdős and McKay we show that every graph G on n vertices for which q(G) ≤ C log n contains an induced subgraph with exactly y edges, for every y between 0 and n. Our methods enable us also to show tha...
متن کاملDisjoint Stars and Forbidden Subgraphs
Let r, k be integers with r ≥ 3, k ≥ 2. We prove that if G is a K1,rfree graph of order at least (k− 1)(2r − 1) + 1 with δ(G) ≥ 2, then G contains k vertex-disjoint copies of K1,2. This result is motivated by characterizing a forbidden subgraph H which satisfies the statement “every H-free graph of sufficiently large order with minimum degree at least t contains k vertex-disjoint copies of a st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2015
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.03.005